Verifying Global Invariants in Multi-Provider Distributed Systems

نویسندگان

  • Sridhar Machiraju
  • Randy H. Katz
چکیده

Confidentiality is an important requirement that restricts information sharing between multiple providers in inter-domain routing and, more generally, in any Multi-Provider Distributed System (MPDS). However, sharing such confidential information can make these systems more robust by enabling the verification of global system invariants. For instance, undesirable interaction between intra-domain and inter-domain routing can be prevented by verifying system invariants involving confidential intra-domain information of neighboring domains. In the literature, it is generally assumed that global system invariants of MPDSs involving confidential information cannot be verified. In this paper, we demonstrate that this is not true by constructing proofof-concept protocols that verify two such invariants relevant for robust inter-domain routing. Our work exposes a hitherto unexplored portion of MPDS design space that has the potential for making such systems more robust.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Distributed Systems: From Specification to Implementation

This paper describes a methodology for developing and verifying a class of distributed systems in which states and state transitions may be continuous or discrete. We focus on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and con...

متن کامل

Finding Counter Examples in Induction Proofs

This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...

متن کامل

A New Reduction for Event-driven Distributed Programs

We consider the problem of provably verifying that an asynchronous message-passing system satisfies its local assertions. We present a novel reduction scheme for asynchronous event-driven programs that finds almost-synchronous invariants— invariants consisting of global states where message buffers are close to empty. The reduction finds almostsynchronous invariants and simultaneously argues th...

متن کامل

Verifying Multi-Agent Knowledge-Based Systems using COVERAGE

Anomaly detection, as performed by the COVER tool, has proven to be a useful method for verification of knowledge-based systems. The increasing development of distributed knowledge-based systems based upon the multi-agent architecture demands techniques for the verification of these systems. This paper describes the COVERAGE too1 -an extension of COVER designed to perform anomaly detection on m...

متن کامل

Distributed multi-agent Load Frequency Control for a Large-scale Power System Optimized by Grey Wolf Optimizer

This paper aims to design an optimal distributed multi-agent controller for load frequency control and optimal power flow purposes. The controller parameters are optimized using Grey Wolf Optimization (GWO) algorithm. The designed optimal distributed controller is employed for load frequency control in the IEEE 30-bus test system with six generators. The controller of each generator is consider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004